Long-run growth rates of discrete multiplicative processes in Markovian environments
نویسندگان
چکیده
منابع مشابه
Long-Run Growth Rates of Discrete Multiplicative Processes in Markovian Environments
If the matrix oi pararrreters of a discrete multiplicative process 1s suhecl Cu certain sequentially dependent random perturbations, the long-run growth rate of the average process is not in general bounded above by the largest sup, Ai of the growth rates A, of the individual matrices which drive the process. The growti rate p of the average process may, in general, be greater or less than the ...
متن کاملVery Long-Run Discount Rates
We provide the first direct estimates of how agents trade off immediate costs and uncertain future benefits that occur in the very long run, 100 or more years away. We find that very longrun discount rates are low, much lower than implied by most economic theory. We estimate these discount rates by exploiting a unique feature of residential housing markets in England, Wales and Singapore, where...
متن کاملLong-Run Policy Analysis and Long-Run Growth
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملHitting times for Multiplicative Growth-collapse Processes
We consider a stochastic process (Xt)t≥0 that grows linearly in time and experiences collapses at times governed by a Poisson process with rate λ. The collapses are modeled by multiplying the process level by a random variable supported on [0, 1). For the hitting time defined as τy = inf{t > 0|Xt = y} we derive power series for the Laplace transform and all moments. We further discuss the asymp...
متن کاملStability of Markovian Processes I: Criteria for Discrete-time Chains
In this paper we connect various topological and probabilistic forms of stability for discrete-time Markov chains. These include tightness on the one hand and Harris recurrence and ergodicity on the other. We show that these concepts of stability are largely equivalent for a major class of chains (chains with continuous components), or if the state space has a sufficiently rich class of appropr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1979
ISSN: 0022-247X
DOI: 10.1016/0022-247x(79)90191-4